Boolean unification with predicates
نویسندگان
چکیده
In this article, we deal with the following problem which we call Boolean unification with predicates: For a given formula F[X ] in first-order logic with equality containing an n-ary predicate variable X , is there a quantifier-free formula G[x1,...,xn] such that the formula F[G] is valid in first-order logic with equality? We obtain the following results. Boolean unification with predicates for quantifier-free F is 2 -complete. In addition, there exists an EXPTIME algorithm which for an input formula F[X ], given as above, constructs a formula G such that F[G] being valid in first-order logic with equality, if such a formula exists. For F of the form ∀yF ′[X ,y] with F ′ quantifier-free, we prove that Boolean unification with predicates is already undecidable. The same holds for F of the form ∃yF ′[X ,y] for F ′ quantifier-free. Instances of Boolean unification with predicates naturally occur in the context of automated theorem proving. Our results are relevant for cut-introduction and the automated search for induction invariants.
منابع مشابه
Datalog Relaunched: Simulation Unification and Value Invention
For reasoning on the Web, Datalog is lacking data extraction and value invention. This article proposes to overcome these limitations with “simulation unification” and “RDFLog”. Simulation unification is a non-standard unification inspired from regular path queries. Like standard unification, it yields bindings for variables in both terms to unify. Unlike standard unification, it does not try t...
متن کاملJPSG Parser on Constraint Logic Programming
This paper presents a constraint logic programming language cu-Prolog and introduces a simple Japanese parser based on Japanese Phrase Structure Grammar (JPSG) as a suitable application of cu-Prolog. cu-Prolog adopts constraint unification instead of the normal Prolog unification. In cu-Prolog, constraints in terms of user defined predicates can be directly added to the program clauses. Such a ...
متن کاملLogic Programming with Pseudo-Boolean Constraints
Boolean constraints play an important role in various constraint logic programming languages. In this paper we consider pseudo-Boolean constraints, that is equations and inequalities between pseudo-Boolean functions. A pseudoBoolean function is an integer-valued function of Boolean variables and thus a generalization of a Boolean function. Pseudo-Boolean functions occur in many application area...
متن کاملEfficient Symmetry Breaking Predicates for Quantified Boolean Formulae
Many reasoning task and combinatorial problems exhibit symmetries. Exploiting such symmetries has been proved useful in reducing the search space. In this paper, a formal approach for symmetry breaking in quantified boolean formula is proposed. It make use of a new efficient technique for encoding the additional symmetry predicates in prenex clausal form. The new asymmetric formula is equivalen...
متن کاملDetecting conjunctive channel predicates in a distributed programming environment
Previous work in efficient detection of global predicates was restricted to predicates that could be specified as a boolean formula of local predicates. Many properties in distributed systems, however, use the state of channels. In this paper, we introduce the concept of a channel predicate and provide an efficient algorithm to detect any boolean formula of local and channel predicates. We defi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 27 شماره
صفحات -
تاریخ انتشار 2017